Rescheduling an electronic meeting

ABSTRACT

A computer-implemented method for effective electronic meeting rescheduling under which time information for a meeting information is received. Invitees to the meeting is identified. An earliest counter time slot for the said meeting is identified. A first set of metadata for the earliest counter time slot is created. A latest counter time slot for said meeting is identified. A second set of metadata for the latest counter time slot is created. Furthermore, the first and second set of metadata to the invitees are sent.

BACKGROUND

The present disclosure relates generally to the field of computer systems, and more particularly to rescheduling electronic meetings.

In most organizations, employees use personal information management systems (hereafter referred to as “PIM”) to coordinate and schedule meetings. PIM generally refers to the practice and the study of the activities people perform in order to acquire, organize, maintain, retrieve and use personal information items, such as, documents (paper-based and digital), web pages and email messages for everyday use to complete tasks and fulfill a person's various roles. Users rely on PIM for scheduling of meetings, appointments and events. Typically, E-mails, calendars and contacts are the three main uses of this system.

Coordinating a meeting among busy professionals can be a challenge due to multiple counterproposals for date/time of the meeting. For instance, different people may have different preferences for date/time of a meeting and those counterproposals may differ vastly.

SUMMARY

The present disclosure implements a system, method, and computer program product which effectively reschedules electronic meetings.

An embodiment of the present disclosure provides a method for effective rescheduling of an electronic meeting. The method includes receiving meeting information and a counterproposal threshold from a user, where, the counterproposal threshold limits the number of counter proposals for the meeting. The method includes identifying a plurality of invitees for transmitting the meeting information, for a scheduled meeting request. The method includes receiving counter proposals from the plurality of invitees, based on the received meeting information. The method includes identifying an earliest counter time slot for the meeting, where the earliest counter time slot is the soonest possible time the invitee attends the meeting. The method includes identifying a latest counter time slot for said meeting, where the latest counter time slot is the latest possible time the invitees attends the meeting. The method includes creating a negotiation range based on the earliest and the latest counter time slots, for attending the meeting. The method further includes generating a dashboard comprising the negotiation range and an option to counter propose within the negotiation range.

Another embodiment of the present disclosure provides a computer system for effective rescheduling of an electronic meeting. An embodiment of the present disclosure provides a computer system for effective rescheduling of an electronic meeting. The computer system includes receiving meeting information and a counterproposal threshold from a user, where, the counterproposal threshold limits the number of counter proposals for the meeting. The computer system includes identifying a plurality of invitees for transmitting the meeting information, for a scheduled meeting request. The computer system includes receiving counter proposals from the plurality of invitees, based on the received meeting information. The computer system includes identifying an earliest counter time slot for the meeting, where the earliest counter time slot is the soonest possible time the invitee attends the meeting. The computer system includes identifying a latest counter time slot for said meeting, where the latest counter time slot is the latest possible time the invitees attends the meeting. The computer system includes creating a negotiation range based on the earliest and the latest counter time slots, for attending the meeting. The computer system further includes generating a dashboard comprising the negotiation range and an option to counter propose within the negotiation range.

Another embodiment of the present disclosure provides a computer program product for effective rescheduling of an electronic meeting. An embodiment of the present disclosure provides a computer program product for effective rescheduling of an electronic meeting. The computer program product includes receiving meeting information and a counterproposal threshold from a user, where, the counterproposal threshold limits the number of counter proposals for the meeting. The computer program product includes identifying a plurality of invitees for transmitting the meeting information, for a scheduled meeting request. The computer program product includes receiving counter proposals from the plurality of invitees, based on the received meeting information. The computer program product includes identifying an earliest counter time slot for the meeting, where the earliest counter time slot is the soonest possible time the invitee attends the meeting. The computer program product includes identifying a latest counter time slot for said meeting, where the latest counter time slot is the latest possible time the invitees attends the meeting. The computer program product includes creating a negotiation range based on the earliest and the latest counter time slots, for attending the meeting. The computer program product further includes generating a dashboard comprising the negotiation range and an option to counter propose within the negotiation range.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

FIG. 1A is schematic block diagram depicting a computing environment for a rescheduling program, according to embodiments of the present invention.

FIG. 1B is as schematic block diagram depicting components of a rescheduling program, according to embodiments of the present invention.

FIG. 2 is a flowchart depicting operational steps of a method 200 for a rescheduling program, according to embodiments of the present invention.

FIG. 3A is a schematic block diagram depicting an electronic meeting rescheduling, according to embodiments of the present invention.

FIG. 3B is a schematic block diagram depicting a dashboard, according to embodiments of the present invention.

FIG. 4 is a block diagram of internal and external components of computers and servers depicted in FIG. 1, according to embodiments of the present invention.

DETAILED DESCRIPTION

FIG. 1A depicts an exemplary computing environment 100 for managing the display of application forms within a web-based application. In various embodiments of the present invention, the environment 100 may include a computer 102 and server 112 connected over communication network 110.

A computer 102 may include a processor 104 and a data storage device 106 that is enabled to run a rescheduling program 108 and a web browser 116 that displays an application form. Non-limiting examples of a web browser may include: Firefox®, Explorer®, or any other web browser. All brand names and/or trademarks used herein are the property of their respective owners. It must be mentioned that the present disclosure is not limited to web browsers and may also be implemented in conjunction with any web application.

A networked computer environment 100 may also include a server 112 with a database 114. The server 112 may be enabled to run a program such a rescheduling program 108. A communication network 110 may represent a worldwide collection of networks and gateways, such as the Internet, that use various protocols to communicate with one another, such as Lightweight Directory Access Protocol (LDAP), Transport Control Protocol/Internet Protocol (TCP/IP), Hypertext Transport Protocol (HTTP), Wireless Application Protocol (WAP), etc. Communication network 110 may also include a number of different types of networks, such as, for example, an intranet, a local area network (LAN), or a wide area network (WAN).

It should be appreciated that FIG. 1A provides only an illustration of one implementation and does not imply any limitations with regard to the environments in which different embodiments may be implemented. Many modifications to the depicted environments may be made based on design and implementation requirements.

The computer 102 may communicate with the server 112 via the communication network 110. The communication network 110 may include connections, such as wire, wireless communication links, or fiber optic cables.

The computer 102 and the server 112 may be, for example, a mobile device, a telephone, a personal digital assistant, a netbook, a laptop computer, a tablet computer, a desktop computer, or any type of computing device capable of running a program and accessing a network. A program, such as a rescheduling program 108 may run on the client computer 102 or on the server 112. It should be appreciated that rescheduling program 108 has the same component and operation methods regardless of whether it is run on the server 112 or computer 102. Therefore, rescheduling program 108 applies to both a rescheduling program 108 run on a computer 102 and rescheduling program 108 run on the server 112 interchangeably.

Referring now to FIG. 1B, a rescheduling program 108 may include a receiving module 118A, identification module 118B, dashboarding module 118C. Receiving module 118A may receive meeting information including time and date of a meeting and a threshold from a chair. A threshold is a determined threshold of the number of counterproposals which has allowed for the meeting. Identification module 118B may identify the participants to the meeting. Participants in this disclosure may be chair and invitee of the meeting.

Chair is a person who creates the meeting and identify the invitees to the meeting. Invitees are people whom Chair has designated as required to attend the meeting. Identification module 118B may also receive counterproposals of the meetings from invitees of the meeting. Identification module 118B may check and see if the threshold is reached. If the threshold is reached, dashboarding module 118C may generate a negotiation range. A negotiation range is a time range which includes the meeting date/time and all the counterpropals. Dashboarding module 118C may achieve this by determining the earliest and latest possible times for the meeting. Dashboarding module 118C may also generate a dashboard which displays the meeting times and the range in order to culminate in the participants of the meeting to choose an appropriate time.

FIG. 2 is a flowchart which in conjunction with FIG. 3A-B depicts operational steps of a method 200 for a rescheduling program, in accordance with an embodiment of the present disclosure. Steps of method 200 may be implemented using one or more modules of a computer program such as rescheduling program 108, and executed by a processor of a computer, such as computer 102.

It should be appreciated that FIG. 2 does not imply any limitations with regard to the environments or embodiments which may be implemented. Many modifications to the depicted environment or embodiment shown in FIG. 2 may be made. FIG. 3 depicts an embodiment of the present disclosure. In this embodiment, a schedule conflict is resolved.

Referring now to 202, receiving module 118A may receive meeting information regarding a meeting. Receiving module 118A may receive a digital text stream comprising one or more words, and/or corresponding metadata, from an electronic input source. Receiving module 118A may receive the information from a user or a computer implemented system. Non-limiting examples of an input source may be spoken words, typed words, or inputting a corpus electronically from a computer implemented source such as an electronic device (e.g. cell phones or tablets).

In an embodiment, a user may create a meeting invite, and input the information regarding that meeting such as name of the invitees, time and date of the meeting, place of the meeting etc. For the purposes of this disclosure the user who creates the meeting invite is hereafter known as “the chair” or “Chair” and the invitees whom the chair has invited to the meeting are hereafter referred to as “invitee” or “invitees”. Chair may also have knowledge that some invitees may not be available during this proposed meeting time therefore chair may set a threshold of counter proposals in the meeting invite. A counter proposal is an alternative proposal made in response to an original meeting (which Chair has created) that is regarded as unacceptable or unsatisfactory. Simply put, an invitee may propose another time/date for a meeting and the second proposal may differ from the original time/date which Chair has indicated. Furthermore, a threshold of counter proposal may be set by Chair and limits the number of counter proposals to a meeting. Threshold of counter proposal may be an individual number (e.g. Chair will not accept more than 1 counter proposal from each invitee), or a total number (e.g. Chair will not accept more than 5 total overall proposals from all invitees combined), or a rate of proposals. A rate proposal is a percentage set by Chair which indicates the threshold by dividing the number of counter proposals by the number of invitees. For example a threshold of counter proposal of 40% indicates that:

(Number of counterproposals)<0.40

(Number of invitees)

In this example, if the number of invitees is set as 10 invitees, then the threshold of counterproposals is set as 4 total counter proposals from all invitees.

In the present embodiment, and illustrated in FIG. 3A, Chair 302 sets a meeting 304 for August 15^(th), at 10:00 am to 11:00 am with a 40% threshold of counterproposal. Chair 302, in the present embodiment, directly inputs the meeting information for meeting 304 in a user interface of a rescheduling program 108.

At 204, the identification module 118B may identify the invitees to the meeting set by Chair. Identification module 118B may identify the invitees as Chair has indicated them. In another embodiment, identification module 118B may identify the invitees using metadata received by the receiving module 118A. In the present embodiment, identification module 118B identifies invitees 306, 308, and 310 as three invitees of meeting 304 as they are indicated by Chair 302.

At 206, the identification module 118B may receive counterproposals from invitees. Identification module 118B may receive these counter proposals directly from the invitee as invitees may send a counterproposal through an interface provided by rescheduling program 108. In other embodiments, identification module 118B may receive counterproposals from a computer implemented program such as another meeting or organizing software or mobile application. In an embodiment, the counterproposals are transformed into metadata or other data structures. In that embodiment, the metadata or other data structure is stored in a repository such as XML repository 318. Extensible Markup Language (XML) is a markup language that defines a set of rules for encoding documents in a format which is both human-readable and machine-readable. It must be appreciated that metadata or data may be saved in other formats and XML is merely an embodiment.

In the present embodiment, invitees 306, 308, and 310 directly input their counter proposals into the user interface of the rescheduling program 108. In the present embodiment, meeting date and time from the original invite is 15th August, 10:00 a.m. to 11:00 a.m. and there are 3 counters:

Counter proposal by Invitee 306: 14^(th) of August, 10:00 a.m. to 11:00 a.m.

Counter proposal by Invitee 308: 17^(th) of August, 11:30 a.m. to 12:30 p.m.

Counter proposal by Invitee 310: 20^(th) of August, 4:00 p.m. to 5:00 p.m.

The elements of this analysis are stored in an XML repository 318. In the present embodiment, the XML is created per meeting instance that is to be analyzed. All such XML's for a user are stored in a temporary location where the user's mail and calendar data is located (This can be a hard drive on user's computer or a remote location for web-based or cloud-based email programs).

At 208, identification module 118B may determine whether the threshold of counterproposal has been met. Identification module 118B may, in one embodiment, using the number of invitees (indicated by the receiving module 118A and number of counter proposals received (at step 206), may calculate a ratio according to the following formula:

(Number of counterproposals)

(Number of invitees)

Identification module 118B may use that ratio, in that embodiment, in order to determine whether the threshold of counterproposals has been satisfied.

In the present embodiment, identification module 118B determines that the threshold has been met. The threshold has been identified as 40% (which was received by the receiving module 118A). A 40% threshold of counterproposal indicates that for a meeting with 3 invitees there is a limit of 2 counter proposals. In the present embodiment, identification module 118B receives 3 counter proposals and therefore determines that the threshold of counter proposal has been satisfied.

It should be mentioned that if the threshold of counter proposal is not satisfied, the invitation may remain the same. In other words if not enough invitees propose new date/times for the meeting, identification module 118B may determine that the meeting as originally indicated by Chair is acceptable and therefore the meeting information may remain the same as original (step 210).

At 212, dashboarding module 118C, determines a negotiation range. A negotiation range is a time range which includes the meeting date/time and all the counterpropals. For example a negotiation range spans between the earliest date/time of the meeting and all the counterproposals received and the latest of said information. In other words dashboarding module 118 c may use the earliest counter date/time slot and latest counter date/time slot to define the negotiation range. It should be mentioned that in one embodiment of this invention, Chair may override the range or preset the acceptable negotiation range when creating the original meeting. In said embodiment, dashboarding module 118C use the pre-determined negotiation range.

In the present embodiment, dashboarding module 118C determines negotiation range 320. Negotiation range 320 spans between 14^(th) of August, at 10:00 a.m. to 20^(th) of August, at 5:00 p.m. The contents of the XML in this embodiment are as follows:

Earliest and latest time slot in the counter proposals—

Earliest time and date—14th August, 10:00 a.m. To 11:00 a.m.

Latest time and date—20th August, 4:00 p.m. To 5:00 p.m.

This now becomes the “negotiation range” and therefore the XML representation is the following:

<broadrange><start>Aug14,10</start><end>Aug20,17</end></broadrange>

At 214, dashboarding module 118C, generates a user interface for the Chair and Invitees in order to resolve the scheduling conflict. Dashboard is a user interface visible to chair & all Invitees for collaborative approach to conflict resolution which may allow the invitees to mark multiple proposed counter time slots. Dashboard may further show the original meeting schedule date/time slot along with all counter slots as well as free/busy data for chair & all invitees. Invitees may edit the dashboard and mark one or more preferred time slot(s) on Dashboard. More specifically, invitees may add more counter proposals or free up their calendar to accommodate this meeting by looking at other's availability/counters on the Dashboard. The Dashboard may continue to auto-update based on every action taken by Chair and/or Invitees.

The dashboard may contain an editable table control listed with the invitees and their corresponding time slots in a row. The table control may have one row for each invitee. The time slots may be selected individually or by group of invitees. The time slot which was selected by the invitee while originally countering the invite may be shown by the “tick-mark” sign in the table control. The dashboard may also contain the scheduling information that is made available from the metadata XML. The time slots where the invitee is busy may be shown as blacked out or unavailable. Other time slots which are designated as free may be selected.

As shown in the FIG. 3B, dashboard 322 contains the basic elements that are present in the metadata XML as described above and displays the permissible broader range of the meeting reschedule which comes automatically populated from the metadata XML. The negotiation range is displayed at box 320. This display allows Chair and Invitees to understand the inner and outer limits of the proposals and counter proposals of the meeting. Dashboard 322 allows Chair to manually edit the range, or choose to have it, as is populated. Dashboard 322, which is visible to all participants of the meeting (i.e. Chair and Invitees), comprises of column 328 and row 330. In the present embodiment, column 328 represents the invitees (i.e. invitees 306, 308, and 310). Row 330 represents different time and dates. It must be mentioned that the date/time represented at row 330 may be customized to show other time/dates and dashboard 322 will customize and update the information according to the displayed date/time range. Dashboard 322, is displaying a time range of 10 am to 8 pm (or 20:00). Every slot within dashboard 322 correspond to an invitee and a date/time information. For example slot 324 represents information regarding invitee 308 at 11:00 am on Aug. 15, 2015.

In the present embodiment and reflected in dashboard 322, a slot maybe checked or blacked out. A blacked out slot (i.e. slot 326) means that the invitee is busy or unavailable during that time slot. On the contrary, when a slot is checked (i.e. slot 324) the invitee is available. In the present embodiment, Chair views the dashboard and find an appropriate time slot for all invitees. Chair find time slots 332 which reflects Aug. 15, 2015 at 15:00 (3:00 pm) and reschedules the meeting to said time.

In another embodiment, Chair and user may not agree on a time slot to have a meeting even after dashboard has determined the appropriate range. In that embodiment, dashboard may select a pre-determined number of counterproposals closest (in time and date to the original meeting time) and suggest to the chair and/or Invitees the selected counterproposals.

In yet another embodiment, the dashboard may have an expiration time. This expiration time ensures that invitees respond to the dashboard requests before the dashboard is expired. The expiration time (which may include a particular date/time or may be set on a duration) may be a preset value or may be modified by Chair. In that embodiment, Invitees must mark their preferences within the expiration time. In case none of the invitee marks their preferred time slots, the slot closest to the original time will be chosen and the reschedule notice will be prepared accordingly.

Referring now to FIG. 4 of components a computer system, for example server 112 and data source 120, of distributed data processing environment 100 of FIG. 1, in accordance with an embodiment of the present disclosure.

Server 112 may include one or more processors 402, one or more computer-readable RAMs 404, one or more computer-readable ROMs 406, one or more computer readable storage media 408, device drivers 412, read/write drive or interface 414, network adapter or interface 416, all interconnected over a communications fabric 418. Communications fabric 418 may be implemented with any architecture designed for passing data and/or control information between processors (such as microprocessors, communications and network processors, etc.), system memory, peripheral devices, and any other hardware components within a system.

One or more operating systems 410, and one or more application programs 411, are stored on one or more of the computer readable storage media 408 for execution by one or more of the processors 402 via one or more of the respective RAMs 404 (which typically include cache memory). In the illustrated embodiment, each of the computer readable storage media 408 may be a magnetic disk storage device of an internal hard drive, CD-ROM, DVD, memory stick, magnetic tape, magnetic disk, optical disk, a semiconductor storage device such as RAM, ROM, EPROM, flash memory or any other computer-readable tangible storage device that can store a computer program and digital information.

Server 112 and computer 102 may also include an R/W drive or interface 414 to read from and write to one or more portable computer readable storage media 426. Application programs 411 on server 112 and computer 102 may be stored on one or more of the portable computer readable storage media 426, read via the respective R/W drive or interface 514 and loaded into the respective computer readable storage media 508.

Server 112 may also include a network adapter or interface 416, such as a TCP/IP adapter card or wireless communication adapter (such as a 4G wireless communication adapter using OFDMA technology). Application programs 411 on server 112 and may be downloaded to the computing device from an external computer or external storage device via a network (for example, the Internet, a local area network or other wide area network or wireless network) and network adapter or interface 416. From the network adapter or interface 416, the programs may be loaded onto computer readable storage media 408. The network may comprise copper wires, optical fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers.

Server 112 and computer 102 may also include a display screen 420, a keyboard or keypad 422, and a computer mouse or touchpad 424. Device drivers 412 interface to display screen 420 for imaging, to keyboard or keypad 422, to computer mouse or touchpad 424, and/or to display screen 420 for pressure sensing of alphanumeric character entry and user selections. The device drivers 412, R/W drive or interface 414 and network adapter or interface 416 may comprise hardware and software (stored on computer readable storage media 408 and/or ROM 406).

The present disclosure may be a system, a method, and/or a computer program product. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present disclosure.

The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.

Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.

Computer readable program instructions for carrying out operations of the present disclosure may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present disclosure.

Aspects of the present disclosure are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.

These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.

Based on the foregoing, a computer system, method, and computer program product have been disclosed. However, numerous modifications and substitutions can be made without deviating from the scope of the present disclosure. Therefore, the present disclosure has been disclosed by way of example and not limitation. 

1.-7. (canceled)
 8. A computer system for rescheduling an electronic meeting, the computer system comprising: one or more computer processors; one or more computer-readable storage media; program instructions stored on the computer-readable storage media for execution by at least one of the one or more processors, the program instructions comprising: instructions to receive meeting information and a counterproposal threshold from a user, wherein, the counterproposal threshold limits a number of counter proposals for the meeting; instructions to identify a plurality of invitees for transmitting the meeting information, for a scheduled meeting request; instructions to receive counter proposals from the plurality of invitees, based on the received meeting information; instructions to identify an earliest counter time slot for the meeting, wherein the earliest counter time slot is a soonest possible time the invitees attend the meeting; instructions to identify a latest counter time slot for said meeting, wherein the latest counter time slot is a latest possible time the invitees attend the meeting; instructions to create a negotiation range based on the earliest and the latest counter time slots, for attending the meeting; and instructions to generate a dashboard comprising the negotiation range and an option to counter propose within the negotiation range.
 9. The computer system of claim 8, further comprising: instructions to present an option to the user and the invitees to counter-propose a new meeting time within the negotiation range.
 10. The computer system of claim 9, further comprising: instructions to present an option to the user to override the meeting information by changing the meeting to a common meeting time within the negotiation range.
 11. The computer system of claim 8, wherein the dashboard comprises an option for the user to allow other invitees to see each other's counterproposals.
 12. The computer system of claim 8, wherein the counterproposal threshold is calculated by dividing a number of invitees of the meeting, and a number of counterproposals received for rescheduling the meeting.
 13. The computer system of claim 8, wherein the dashboard has an expiration time, and, wherein the expiration time ensures that invitees respond to the dashboard before the dashboard is expired.
 14. The computer system of claim 8, further comprising: instructions to select a pre-determined number of counterproposals closest to the meeting and presenting it to the user.
 15. A computer program product for rescheduling an electronic meeting, comprising a computer-readable storage medium having program code embodied therewith, the program code executable by a processor of a computer to perform a method comprising: receiving meeting information and a counterproposal threshold from a user, wherein, the counterproposal threshold limits a number of counter proposals for the meeting; receiving meeting information and a counterproposal threshold from a user, wherein, the counterproposal threshold limits a number of counter proposals for the meeting; identifying a plurality of invitees for transmitting the meeting information, for a scheduled meeting request; receiving counter proposals from the plurality of invitees, based on the received meeting information; identifying an earliest counter time slot for the meeting, wherein the earliest counter time slot is a soonest possible time the invitees attend the meeting; identifying a latest counter time slot for said meeting, wherein the latest counter time slot is a latest possible time the invitees attend the meeting; creating a negotiation range based on the earliest and the latest counter time slots, for attending the meeting; and generating a dashboard comprising the negotiation range and an option to counter propose within the negotiation range.
 16. The computer program product of claim 15, further comprising: presenting an option to the user and the invitees to counter-propose a new meeting time within the negotiation range.
 17. The computer program product of claim 15, wherein the dashboard comprises an option for the user to allow other invitees to see each other's counterproposals.
 18. The computer program product of claim 15, wherein the counterproposal threshold is calculated by dividing a number of invitees of the meeting, and a number of counterproposals received for rescheduling the meeting.
 19. The computer program product of claim 15, wherein the dashboard has an expiration time, and, wherein the expiration time ensures that invitees respond to the dashboard before the dashboard is expired.
 20. The computer program product of claim 15, further comprising: selecting a pre-determined number of counterproposals closest to the meeting and presenting it to the user. 